A q-polynomial approach to cyclic codes
نویسندگان
چکیده
Article history: Received 27 August 2012 Revised 26 November 2012 Accepted 14 December 2012 Available online xxxx Communicated by Simeon Ball MSC: 94B15 94B05 05B50
منابع مشابه
Another q-Polynomial Approach to Cyclic Codes
c0 + c1x+ c2x 2 + · · ·+ cn−1x n−1 ∈ GF(q)[x]/(x − 1), any code C of length n over GF(q) corresponds to a subset of the quotient ring GF(q)[x]/(xn− 1). A linear code C is cyclic if and only if the corresponding subset in GF(q)[x]/(xn − 1) is an ideal of the ring GF(q)[x]/(xn − 1). It is well known that every ideal of GF(q)[x]/(xn−1) is principal. Let C = 〈g(x)〉 be a cyclic code, where g(x) is m...
متن کاملThe Theory of Cyclic Codes and a Generalization to Additive Codes
We present a new approach to the theory of cyclic and constacyclic codes and generalize the theory to cover the family of additive (not necessarily linear) cyclic codes. The approach is based on the action of the Galois group (cyclotomic cosets). The conventional representation of cyclic codes as ideals in a factor ring of the polynomial ring is not needed. 1 General facts on linear codes The c...
متن کاملOn Repeated-root Cyclic Codes
A parity-check matrix for a q -ary repeated-root cyclic code is derived using the Hasse derivative. Then the min imum distance of a q-ary repeated-root cyclic code C is expressecin terms of the min imum distance of a certain simple-root cyclic code C that is determined by C. With the help of this result, several binary repeated-root cyclic codes of lengths up to n = 62 are shown to contain the ...
متن کاملCyclic Sieving for Cyclic Codes
These are notes on a preliminary follow-up to a question of Jim Propp, about cyclic sieving of cyclic codes. We show that two of the Mahonian polynomials are cyclic sieving polynomials for certain Dual Hamming Codes: X and X inv for q = 2, 3 and q = 2, respectively.
متن کاملSkew cyclic codes over $\mathbb{F}_{q}+v\mathbb{F}_{q}+v^{2}\mathbb{F}_{q}$
In this article, we study skew cyclic codes over ring R = Fq + vFq + v 2 Fq, where q = p, p is an odd prime and v3 = v. We describe generator polynomials of skew cyclic codes over this ring and investigate the structural properties of skew cyclic codes over R by a decomposition theorem. We also describe the generator polynomials of the duals of skew cyclic codes. Moreover, the idempotent genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Finite Fields and Their Applications
دوره 20 شماره
صفحات -
تاریخ انتشار 2013